The Discrete Logarithm Hides O(log n) Bits
نویسندگان
چکیده
The main result of this paper is that obtaining any information about the $O(log |p|)$ " most significant " bits of $x$, given $g^x(mod p)$, even with a tiny advantage over guessing, is equivalent to computing discrete logarithms $mod p$.
منابع مشابه
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for this function. We consider a special case of this problem, the discrete logarithm with short exponents, which is also believed to be hard to compute. Under this intractibility assumption we show that discrete exponent...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملThe Discrete Logarithm Modulo a Composite Hides O(n) Bits
In this paper we consider the one-way function f g;N (X) = g X (modN), where N is a Blum integer. We prove that under the commonly assumed intractability of factoring Blum integers, all its bits are individually hard, and the lower as well as upper halves of them are simultaneously hard. As a result, f g;N can be used in eecient pseudo-random bit generators and multi-bit commitment schemes, whe...
متن کاملThe Security of All Bits Using List Decoding
The relation between list decoding and hard-core predicates has provided a clean and easy methodology to prove the hardness of certain predicates. So far this methodology has only been used to prove that the O(log log N) least and most significant bits of any function with multiplicative access —which include the most common number theoretic trapdoor permutations— are secure. In this paper we s...
متن کاملA quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log n)
Improving over an earlier construction by Kaye and Zalka [1], in [2] Maslov et al. describe an implementation of Shor’s algorithm, which can solve the discrete logarithm problem on ordinary binary elliptic curves in quadratic depth O(n). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log n). As technical tools we introduce quantum ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 17 شماره
صفحات -
تاریخ انتشار 1988